Transforming acyclic programs
نویسندگان
چکیده
منابع مشابه
Transforming Acyclic
An Unfold/Fold transformation system is a source-to-source rewriting methodology devised to improve the eeciency of a program. Any such transformation should preserve the main properties of the initial program: among them, termination. To this end, in the eld of logic programming, the class of acyclic programs plays an important role, as it is closely related to the one of terminating programs....
متن کاملTransforming complex network to the acyclic one
Abstract Acyclic networks are a class of complex networks in which links are directed and don’t have closed loops. Here we present an algorithm for transforming an ordinary undirected complex network into an acyclic one. Further analysis of an acyclic network allows finding structural properties of the network. With our approach one can find the communities and key nodes in complex networks. Al...
متن کاملLearning Weakly Acyclic Horn Programs
We consider a general class of \weakly acyclic Horn programs" where the literals implied by the examples and the target clauses form an acyclic dependency graph. A Horn clause is transparent if all the terms in all its derivations from the target program are contained in the clause itself. A Horn program is transparent if all its clauses are transparent. We show that any subclass of rst-order w...
متن کاملTransforming Abductive Logic Programs to Disjunctive Programs
A new xpoint semantics for abductive logic programs is provided, in which the generalized stable models of an abductive program are characterized as the xpoint of a disjunctive program obtained by a suitable program transformation. In the transformation, both negative hypotheses through negation as failure and positive hypotheses from the abducibles are dealt with uniformly. This characterizati...
متن کاملTransforming Programs into Recursive Functions
This paper presents a new proof-assistant based approach to program verification: programs are translated, via fully-automatic deduction, into tail-recursive function defined in the logic of a theorem prover. This approach improves on well-established methods based on Hoare logic and verification condition generation (VCG) by removing the need to annotate programs with assertions, making the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 1994
ISSN: 0164-0925,1558-4593
DOI: 10.1145/183432.183434